package com.mlamp.动态规划;

public class 最长回文子串 {

    public static void main(String[] args) {

    }

    public static String longestPalindrome(String s) {
        int n = s.length();
        boolean dp[][] = new boolean[n][n];
        String res = "";
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n - i; j++) {
                int k = i + j;
                if (i == 0) {
                    dp[i][k] = true;
                }

            }

        }
        return null;
    }
}
